Relating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
نویسندگان
چکیده
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for unique features of this defeasible logic.
منابع مشابه
Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
The most recent version of defeasible logic (Nute, 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs using a simple scheme proposed in (Brewka, 2001). It is found that by introducing ambiguity propagation into this logic, the assertions of defeasible theories coincide with the well-founded models of their logic program translations. Wit...
متن کاملInterdefinability of defeasible logic and logic programming under the well-founded semantics
We provide a method of translating theories of Nute’s defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalis...
متن کاملWell-Founded Semantics for Default Logic
Default logic is one of the most popular approaches to model defeasible reasoning. Nevertheless, there are a number of problems with Reiter's original semantics that have led to the investigation of alternative approaches. In particular, Baral/Subrahmanian and Przymusinska/Przymusinski have investigated generalizations of well-founded semantics for normal logic programs to default logic. These ...
متن کاملOn the Relationship between Defeasible Logic and Well-Founded Semantics
We investigate in this paper the relationship between an ambiguity propagating defeasible logic recently proposed by Antoniou et al. 3] and well-founded semantics with priorities 6] under a straightforward translation from defeasible theories to extended logic programs. It turns out that a slightly restricted version of defeasible logic is correct wrt well-founded semantics yet incomplete. We a...
متن کاملRelating defeasible and normal logic programming through transformation properties
This paper relates the Defeasible Logic Programming (DeLP ) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals ( A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP ), there is only one kind of...
متن کامل